Practical and efficient algorithms for the geometric hitting set problem
نویسندگان
چکیده
منابع مشابه
Efficient and Effective Practical Algorithms for the Set-Covering Problem
The set-covering problem is an interesting problem in computational complexity theory. In [1], the setcovering problem has been proved to be NP hard and a greedy heuristic algorithm is presented to solve the problem. In [2], the set-covering problem is found to be equivalent to the problem of identifying redundant search engines on the Web, and finding efficient and effective practical algorith...
متن کاملGeometric Hitting Set and Set Cover Problem with Half-Strips
We show that hitting set and set cover problems with half-strips oriented in two opposite directions are NPcomplete.
متن کاملThe minimal hitting set generation problem: algorithms and computation
Finding inclusion-minimal hitting sets for a given collection of sets is a fundamental combinatorial problem with applications in domains as diverse as Boolean algebra, computational biology, and data mining. Much of the algorithmic literature focuses on the problem of recognizing the collection of minimal hitting sets; however, in many of the applications, it is more important to generate thes...
متن کاملNew Approaches for Efficient Solution of Hitting Set Problem
A new method for solving the hitting set problem is proposed. This method is based on the mapping of the problem onto an integer programming optimization problem. This new approach provides an algorithm with much better performance compare to the algorithms for the bitting set problem that currently are used for solving the diagnosis problem. The relation of this approach with the satisfiabilit...
متن کاملImproved Local Search for Geometric Hitting Set
Over the past several decades there has been steady progress towards the goal of polynomial-time approximation schemes (PTAS) for fundamental geometric combinatorial optimization problems. A foremost example is the geometric hitting set problem: given a set P of points and a set D of geometric objects, compute the minimum-sized subset of P that hits all objects in D. For the case where D is a s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2018
ISSN: 0166-218X
DOI: 10.1016/j.dam.2017.12.018